Bootstrapping clustered data

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bootstrapping clustered data

Various bootstraps have been proposed for bootstrapping clustered data from one-way arrays. The simulation results in the literature suggest that some of these methods work quite well in practice; the theoretical results are limited and more mixed in their conclusions. For example, McCullagh reached negative conclusions about the use of non-parametric bootstraps for one-way arrays. The purpose ...

متن کامل

Bootstrapping I(1) data

A functional law is given for an I(1) sample data version of the continuous-path block bootstrap of Paparoditis and Politis (2001a). The results provide an alternative demonstration that continuous-path block bootstrap unit root tests are consistent under the null. © 2010 Elsevier B.V. All rights reserved.

متن کامل

Bootstrapping Big Data

The bootstrap provides a simple and powerful means of assessing the quality of estimators. However, in settings involving large datasets, the computation of bootstrap-based quantities can be prohibitively computationally demanding. As an alternative, we introduce the Bag of Little Bootstraps (BLB), a new procedure which incorporates features of both the bootstrap and subsampling to obtain a mor...

متن کامل

Inference for Clustered Data

This article introduces clusteff, a new Stata command for checking the severity of cluster heterogeneity in cluster robust analyses. Cluster heterogeneity can cause a size distortion leading to underrejection of the null hypothesis. Carter, Schnepel, and Steigerwald (2015) develop the effective number of clusters to reflect a reduction in the degrees of freedom, thereby mirroring the distortion...

متن کامل

Clustered Data Parallelism

Many data layout optimizations cluster data accesses and memory into high-locality groups in order to optimize for the memory hierarchy. In this paper, we demonstrate that similar clustering program transformations enable efficient vectorization. We call this approach clustered data parallelism (CDP). CDP enables fast and power-efficient parallelism by partitioning a data structure into cluster...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Royal Statistical Society: Series B (Statistical Methodology)

سال: 2007

ISSN: 1369-7412,1467-9868

DOI: 10.1111/j.1467-9868.2007.00593.x